Generalizability of the propositional and predicate calculi to infinite-valued calculi.
نویسندگان
چکیده
منابع مشابه
Approximating Propositional Calculi by Finite-Valued Logics
Bernays introduced a method for proving underivability results in propositional calculi C by truth tables. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that the best candidate matrices for (1) can be computed from the calculus, and how sequences for (2) can be found for certain classes of logics. Furthermore, ...
متن کاملOn Number of Lindenbaum's Oversystems of Propositional and Predicate Calculi
0. The present paper is a continuation of [6] and [7]. Thus the content of this paper is the following. At first we establish properties of systems S n and S2∗ n , where systems S 2 n and S 2∗ n are extensions of Rasiowa-S lupecki’s systems Sn and S∗ n. Then we shall show that for every cardinal number m there exist a system ST4 m of propositional calculus and a system SP 4 m of predicate calcu...
متن کاملEquational calculi and constant depth propositional proofs
We deene equational calculi for proving equations between functions in the complexity classes ACC(2) and TC 0 , and we show that proofs in these calculi can be simulated by polynomial size, constant depth proofs in Frege systems with counting modulo 2 and threshold connectives respectively.
متن کاملFrom Finite to Infinite Lambda Calculi
In a previous paper we have established the theory of transfinite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. This results in several new Böhm models of the lambda calculus, and new unifying descriptions of existing models.
متن کاملOn Sequent Calculi for Intuitionistic Propositional Logic
The well-known Dyckoff’s 1992 calculus/procedure for intuitionistic propositional logic is considered and analyzed. It is shown that the calculus is Kripke complete and the procedure in fact works in polynomial space. Then a multi-conclusion intuitionistic calculus is introduced, obtained by adding one new rule to known calculi. A simple proof of Kripke completeness and polynomial-space decidab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1970
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093893867